Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation
نویسندگان
چکیده
How to reduce the accidents of hazardous materials has become an important and urgent research topic in safety management materials. In this study, we focus on half open multi-depot heterogeneous vehicle routing problem for transportation. The goal is determine allocation optimal route with minimum risk cost A novel transportation model presented considering variation loading, types, category. order balance cost, propose a bi-objective mixed integer programming model. hybrid intelligent algorithm developed based ?-constraint method genetic obtain Pareto solutions. Numerical experiments are provided demonstrate effectiveness proposed Compared close problem, average obtained by can be reduced 3.99% 2.01%, respectively. addition, compared homogeneous significantly acceptable risk.
منابع مشابه
capacitated multi-depot vehicle routing problem with inter-depot routes
in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...
متن کاملComparison between Combined and Separate Approaches for Solving a Location-Routing Problem in Hazardous Materials Transportation
In the case of hazardous materials management, selected routes for carrying hazardous materials (i.e., hazmat) have significant effects on locating hazmat distribution centers. Since, risk and cost are usually considered as two main attributes to determine the best routes, optimized locations are sequentially outlined depending on selected routes. In the present paper, t...
متن کاملThe Multi-Depot Vehicle Routing Problem with Inter-Depot Routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2021
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su13031262